Teaching Gödel’s incompleteness theorems
نویسنده
چکیده
The basic notions of logic—predicate logic, Peano arithmetic, incompleteness theorems, etc.—have for long been an advanced topic. In the last decades, they became more widely taught, in philosophy, mathematics, and computer science departments, to graduate and to undergraduate students. Many textbooks now present these notions, in particular the incompleteness theorems. Having taught these notions for several decades, our community can now stand back and analyze the choices faced when designing such a course. In this note, we attempt to analyze the choices faced when teaching the incompleteness theorems. In particular, we attempt to defend the following points.
منابع مشابه
Gödel’s Completeness and Incompleteness Theorems
This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical perception of mathematics and call into question the readily apparent strength of the system itself. This paper will discuss the theorems themselves, their philosophical impact on the study of mathematics and some of the logical background necessary to u...
متن کاملCitations about Gödel’s Theorems
This is a short account of various notes and opinions about Gödel’s theorems I found in my books. It should ease the task of actually writing something about Gödel’s First Incompleteness Theorem. Citations about Gödel’s Theorems
متن کاملWhat Gödel’s Theorem Really Proves
It is proved in this paper the undecidable formula involved in Gödel’s first incompleteness theorem would be inconsistent if the formal system where it is defined were complete. So, before proving the formula is undecidable it is necessary to assume the system is not complete in order to ensure the formula is not inconsistent. Consequently, Gödel proof does not prove the formal system is incomp...
متن کاملOn the information-theoretic approach to Gödel’s incompleteness theorem
In this paper we briefly review and analyze three published proofs of Chaitin’s theorem, the celebrated information-theoretic version of Gödel’s incompleteness theorem. Then, we discuss our main perplexity concerning a key step common to all these demonstrations.
متن کاملGödel’s Incompleteness Theorems Hand-in Exercises and Model Solutions
b) (3 points) Define a new function F ′ by: F ′(0,m, ~y, x) = G(~y,Km(x)) F ′(n+ 1,m, ~y, x) = H(n, F ′(n,m, ~y, x), ~y,Km−̇(n+1)(x)) Recall that Km−̇(n+1) means: the function K applied m−̇(n+1) times. Prove: if n ≤ m then ∀k[F ′(n,m+ k, ~y, x) = F ′(n,m, ~y,Kk(x))] c) (3 points) Prove by induction: F (z, ~y, x) = F ′(z, z, ~y, x) and conclude that F is primitive recursive, also without the assump...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017